Catalytic computation
نویسنده
چکیده
How much space (memory) does one need to solve a system of linear equations, reachability on a directed graph or satisfiability of a Boolean formula? We do not know a good answer to this question but our best algorithms for all of these problems require working memory of size at least linear – that is proportional to the number of variables of the system or the number of vertices in the graphs. Can we do better?
منابع مشابه
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to construct Bare Bones programs by programming the state transitions of a multifunctional catalytic particle. Molecular counts represent program variables, and are altered by the action of the catalytic particle. Chemica...
متن کاملDecidability of Divergence for Catalytic P Systems
P systems are a biologically inspired model introduced by Gheorghe Păun with the aim of representing the structure and the functioning of the cell. Since their introduction, several variants of P systems have been proposed and explored. We concentrate on the class of catalytic P systems without priorities associated to the rules. We show that the divergence problem (i.e., checking for the exist...
متن کاملSimulation of the Transient, Compressible, Gas-dynamic Behavior of Catalytic-combustion Ignition in Stagnation Flows
This paper develops and uses a computation model to explore the transient ignition dynamics of catalytic combustion in a stagnation-flow configuration. The analysis considers the elementary heterogeneous chemistry associated with catalytic behavior at the surface. It also considers gas-dynamic effects in the boundary layer, including temporal and spatial pressure variations. The gas-dynamic eff...
متن کاملNonuniform catalytic space and the direct sum for space
This paper initiates the study of k-catalytic branching programs, a nonuniform model of computation that is the counterpart to the uniform catalytic space model of Buhrman, Cleve, Koucký, Loff and Speelman (STOC 2014). A k-catalytic branching program computes k boolean functions simultaneously on the same n-bit input. Each function has its own entry, accept and reject nodes in the branching pro...
متن کاملEvaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it counts only on slow growth rates and weak selective pressure to steer the search process, catalytic search is an inherently slow process. However it presents interesting properties worth exploring, such as the potent...
متن کاملShaping up nucleic acid computation.
Nucleic acid-based nanotechnology has always been perceived as novel, but has begun to move from theoretical demonstrations to practical applications. In particular, the large address spaces available to nucleic acids can be exploited to encode algorithms and/or act as circuits and thereby process molecular information. In this review we not only revisit several milestones in the field of nucle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bulletin of the EATCS
دوره 118 شماره
صفحات -
تاریخ انتشار 2016